A Fuzzy Simheuristic for the Permutation Flow Shop Problem under Stochastic and Fuzzy Uncertainty

نویسندگان

چکیده

Stochastic, as well fuzzy uncertainty, can be found in most real-world systems. Considering both types of uncertainties simultaneously makes optimization problems incredibly challenging. In this paper, we analyze the permutation flow shop problem (PFSP) with stochastic and processing times. The main goal is to find solution (permutation jobs) that minimizes expected makespan. However, due existence other characteristics are also taken into account. particular, illustrate how survival analysis employed enrich probabilistic information given decision-makers. To solve aforementioned problem, extend concept a simheuristic framework so it include elements. Hence, uncertainty incorporated PFSP. order test our approach, classical PFSP instances have been adapted extended, times become either or fuzzy. experimental results show effectiveness proposed approach when compared more traditional ones.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Multi-objective Permutation Flow Shop Scheduling Problem with Fuzzy Processing Times under Learning and Aging Effects

In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...

متن کامل

A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

متن کامل

A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

متن کامل

A Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times

This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...

متن کامل

Handling Fuzzy Constraints in Flow Shop Problem

In this paper, we present an approach to deal with fuzzy constraints in a flow shop problem. The flexible constraints on job release date and due date, as well as job processing time are described by fuzzy sets. We propose a method to calculate the satisfaction degree of the schedule with respect to fuzzy release dates and fuzzy due dates of jobs. The objective is to obtain a schedule which has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10101760